On the Existence of a Feasible Flow in a Stochastic Transportation Network

نویسندگان

  • András Prékopa
  • Endre Boros
چکیده

A. Prékopa and E. Boros published a paper “On the Existence of a Feasible Flow in a Stochastic Transportation Network” that appeared in Operations Research 39(1991), 119-129. In that paper the authors gave a powerful technique to evaluate transportation system reliability. At the nodes production takes place and the products are shipped on the arcs. Interconnected power systems are the primary examples for the application of the method. Reliability means that in case of efficiency in the electricity production, the power system can assist each other so that all demand can be met. The mentioned reliability calculation method uses probability bounding techniques developed by the same authors. However, there are some other bounds based on individual probability calculations which can be used to compute more efficient bounds. The proposed project aims to improve on the reliability calculation method, by using other and more recent probability bounding techniques. These improved bounds; hunter bound and cherry tree bounds are calculated based on individual probabilities. Acknowledgements: The first two authors were supported by DIMACS Graduate Student Award, Summer 2008.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity Drop Estimation Based on Stochastic Approach Applied to Tehran-Karaj Freeway

Existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. Several researches have focused on capacity drop existence and also its estimation issues. This paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

متن کامل

A Benders' Decomposition Method to Solve Stochastic Distribution Network Design Problem with Two Echelons and Inter-Depot Transportation

 In many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. This paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. This service level, which is consider...

متن کامل

On Search for all d-MCs in a Network Flow

A number of problems in several areas such as power transmission and distribution, communication and transportation can be formulated as a stochastic-flow network (SFN). The system reliability of an SFN can be computed in terms of all the upper boundary points, called d-MinCuts (d-MCs). Several algorithms have been proposed to find all the d-MCs in an SFN. Here, some recent studies in the liter...

متن کامل

On Calibration and Application of Logit-Based Stochastic Traffic Assignment Models

There is a growing recognition that discrete choice models are capable of providing a more realistic picture of route choice behavior. In particular, influential factors other than travel time that are found to affect the choice of route trigger the application of random utility models in the route choice literature. This paper focuses on path-based, logit-type stochastic route choice models, i...

متن کامل

Enumeration of Dominant Solutions: An Application in Transport Network Design

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

متن کامل

Multi-commodity Multimodal Splittable Logistics Hub Location Problem with Stochastic Demands

This study presents a multimodal hub location problem which has the capability to split commodities by limited-capacity hubs and transportation systems, based on the assumption that demands are stochastic for multi-commodity network flows. In the real world cases, demands are random over the planning horizon and those which are partially fulfilled, are lost. Thus, the present study handles dema...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations Research

دوره 39  شماره 

صفحات  -

تاریخ انتشار 1991